Efficient Signcryption with Key Privacy from Gap Diffie-Hellman Groups
نویسندگان
چکیده
This paper proposes a new public key authenticated encryption (signcryption) scheme based on the Diffie-Hellman problem in Gap Diffie-Hellman groups. This scheme is built on the scheme proposed by Boneh, Lynn and Shacham in 2001 to produce short signatures. The idea is to introduce some randomness into this signature to increase its level of security in the random oracle model and to re-use that randomness to perform encryption. This results in a signcryption protocol that is more efficient than any combination of that signature with an El Gamal like encryption scheme. The new scheme is also shown to satisfy really strong security notions and its strong unforgeability is tightly related to the Diffie-Hellman assumption in Gap Diffie-Hellman groups.
منابع مشابه
Analysis of improved signcryption scheme with key privacy
In this paper, we analyse the Yang–Wong–Deng signcryption scheme [G. Yang, D.S. Wong, X. Deng, Analysis and improvement of a signcryption scheme with key privacy, in: Information Security Conference—ISC’05, in: Lecture Notes in Comput. Sci., vol. 3650, Springer-Verlag, Berlin, 2005, pp. 218–232] proposed in ISC’05, which is the improvement and enhancement of the security of Libert–Quisquater si...
متن کاملImproved Signcryption from q-Diffie-Hellman Problems
This paper proposes a new public key authenticated encryption (signcryption) scheme based on the hardness of q-Diffie-Hellman problems in Gap Diffie-Hellman groups. This new scheme is quite efficient: the signcryption operation has almost the same cost as an El Gamal encryption while the reverse operation only requires one pairing evaluation and three exponentiations. The scheme’s chosen-cipher...
متن کاملCertificateless aggregate signcryption: Security model and a concrete construction secure in the random oracle model
Certificateless cryptography; Aggregate signcryption; Random oracle model; Bilinear pairing Abstract The concept of aggregate signcryption was first introduced in 2009 by Selvi et al. [Identity based aggregate signcryption schemes, Lecture Notes in Computer Science 5922 LNCS, 2009, pp. 378–397]. The aggregation process of these schemes reduces the amount of exchanged information and is particul...
متن کاملCertificateless Aggregate Signcryption Schemes
The concept of an aggregate signcryption scheme was first introduced in 2009 by Selvi S.S.D. et. al. in the identity-based setting. The aggregation process of these schemes reduces the amount of exchanged information and is particularly useful in low-bandwidth communication networks and computationally-restricted environments. In this paper, we define a suitable security model for certificatele...
متن کاملAn Efficient Signcryption Scheme from q-Diffie-Hellman Problems
Confidentiality and authenticity are two fundamental security requirement of Public key Cryptography. These are achieved by encryption scheme and digital signatures respectively. Here we present a provably secure signcryption scheme in random oracle model by modifying Libert et al’s scheme [2]. Our scheme is more efficient and secure than Libert et al’s scheme. Tan [1] proved that this scheme i...
متن کامل